Optimized low-delay source-channel-relay mappings
نویسندگان
چکیده
منابع مشابه
Distributed Joint Source-Channel Coding for Relay Systems Exploiting Source-Relay Correlation and Source Memory
In this article, we propose a distributed joint source-channel coding (DJSCC) technique that well exploits source-relay correlation as well as source memory structure simultaneously for transmitting binary Markov sources in a one-way relay system. The relay only extracts and forwards the source message to the destination, which implies imperfect decoding at the relay. The probability of errors ...
متن کاملFlow-optimized Cooperative Transmission for the Relay Channel
This paper describes an approach for half-duplex cooperative transmission to achieve cooperative diversity in a classical three-node relay channel. Assuming availability of channel state information at the source and relay, the approach makes use of this information to optimize distinct flows through the direct link from the source to the destination and the path via the relay, respectively. It...
متن کاملSource-Channel Coding Strategies: Tandem Coding vs. Channel-Optimized Quantization
Two common source-channel coding strategies, tandem coding and channel-optimized quantization, are compared on the basis of distortion vs. complexity by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Transform coding is used in each strategy, and Reed-Solomon codes are added to form the tandem code. For each strategy, formulas...
متن کاملUniversal Zero-Delay Joint Source-Channel Coding
We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary finite set of schemes with finite-memory (not necessarily time-invariant) decoders, a scheme is devised that does essentially as well as the best in the set on all individual source sequences. Using this scheme, we construct a universal zero-delay joint source-channe...
متن کاملStrategies for Delay-Limited Source-Channel Coding
In point-to-point source-channel communication with a fidelity criterion and a transmission cost constraint, the region of achievable cost and fidelity pairs is completely characterized by Shannon’s separation theorem. However, this is in general only true if coding of arbitrary complexity and delay is admitted. If the delay is constrained, the separation theorem only provides an outer bound to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2010
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2010.05.080595